On the complexity of equational problems in CNF
نویسنده
چکیده
Equational problems (i.e.: rst-order formulae with quantiier preex 9 8 , whose only predicate symbol is syntactic equality) are an important tool in many areas of Computer Science like automated deduction, automated model building, logic programming , functional programming, etc. The aim of this work is a complexity analysis of the satissability problem of equational problems over a nite domain. Our main result is the p 2-completeness proof for equational problems in CNF.
منابع مشابه
Effect of Cuneiformis Nucleus Inactivation by Lidocaine Microinjection on the Analgesic Response of Morphine in Rats
The present study was performed to evaluate the analgesic effect of morphine microinjection into the cuneiformis nucleus (CnF) and the effect of inactivation of this area by lidocaine on pain modulation. Rats were anaesthetized by thiopental (45-60 mg/kg/i.p.) and placed in a stereotaxic instrument, and then a guide cannula was implanted just one mm above the CnF. Following surgery and recovery...
متن کاملThe Complexity of Counting Problems in Equational Matching
We introduce a class of counting problems that arise naturally in equational matching and study their computational complexity. If E is an equational theory, then #E-Matching is the problem of counting the number of complete minimal E-matchers of two given terms. #E-Matching is a well-deened algorithmic problem for every nitary equational theory. Moreover, it captures more accurately the comput...
متن کاملPhase Transitions and Complexity of Weighted Satisfiability and Other Intractable Parameterized Problems
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effort to extend this line of research to random instances of intractable parameterized problems. We propose random models for a representative intractable parameterized problem, the weighted d-CNF satisfiability, and its g...
متن کاملAsymmetric Unification and Disunification
We compare two kinds of unification problems: Asymmetric Unification and Disunification, which are variants of Equational Unification. Asymmetric Unification is a type of Equational Unification where the right-hand sides of the equations are in normal form with respect to the given term rewriting system. In Disunification we solve equations and disequations with respect to an equational theory....
متن کاملFUZZY EQUATIONAL CLASSES ARE FUZZY VARIETIES
In the framework of fuzzy algebras with fuzzy equalities and acomplete lattice as a structure of membership values, we investigate fuzzyequational classes. They consist of special fuzzy algebras fullling the samefuzzy identities, dened with respect to fuzzy equalities. We introduce basicnotions and the corresponding operators of universal algebra: construction offuzzy subalgebras, homomorphisms...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 36 شماره
صفحات -
تاریخ انتشار 2003